A method of batching conflict routings in shuffle–exchange networks
نویسندگان
چکیده
منابع مشابه
Fault-tolerant routings in chordal ring networks
This paper studies routing vulnerability in networks modeled by chordal ring graphs. In a chordal ring graph, the vertices are labeled in Z2n and each even vertex i is adjacent to the vertices i + a, i + b, i + c, where a, b, and c are different odd integers. Our study is based on a geometrical representation that associates to the graph a tile which periodically tessellates the plane. Using th...
متن کاملComparison of Network Topological Routings in Wireless Sensor Networks
Wireless Sensor Networks (WSNs) consist of thousands of tiny nodes having the capability of sensing, computation, and wireless communications. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy consumption is an essential design issues. Since wireless sensor network protocols are application specific, so the focus has been give...
متن کاملOptical index of fault tolerant routings in WDM networks
Maňuch and Stacho [7] introduced the problem of designing f -tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur in the network. In this paper, we provide f -tolerant routings in complete and complete balanced bipartite optical networks, optimal according to two parameters: the arc-forwarding index and the optical index. These co...
متن کاملReliable Routings in Networks with Generalized Link Failure Events
Traditional methods for ensuring reliable transmissions in circuitswitched networks rely on the pre computation of a backup path for every working path or for every network link These methods work fine as long as the network experiences only single link failures. They do not guarantee undisturbed communication, however, in the case of multiple link failures. Such failures are not seldom and oft...
متن کاملMessage batching in wireless sensor networks - A perturbation analysis approach
We address the problem of batching messages generated at nodes of a sensor network for the purpose of reducing communication energy at the expense of added latency. We consider a time-based batching approach. We first develop baseline analytical models based on Markovian assumptions, derive conditions under which batching is profitable, and explicitly determine a batching time that optimizes a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.12.003